title : Provably Fast Training Algorithms for Support Vector Machines

نویسندگان

  • Jose Balcázar
  • Yang Dai
  • Junichi Tanaka
  • Osamu Watanabe
چکیده

title: Provably Fast Training Algorithms for Support Vector Machines author: Jose Balcázar1, Yang Dai2, Junichi Tanaka3, and Osamu Watanabe3 affiliation: 1. Departament de Llenguatges i Sistemes Informatics, Univ. Politecnica de Catalunya Campus Nord, Jordi Girona Salgado 1-3, 08034 Barcelona, Spain 2. Dept. of Bioengineering (MC063), Univ. Illionis at Chicago 851 S. Morgan Str, Chicago, IL 60607-7052, USA 3. Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology Meguro-ku Ookayama, Tokyo 152-8552, Japan email: [email protected] acknowledgments to financial supports: The first and the forth authors started this research while visiting the Centre de Recerca Mathemàtica of the Institute of catalan Studies in Barcelona. The first author is supported by IST Programme of the EU under contract number IST-199914186 (ALCOM-FT), EU EP27150 (Neurocolt II), Spanish Government PB98-0937C04 (FRESCO), and CIRIT 1997SGR-00366. The second author conducted this research while she is with Dept. of Mathematical and Computing Sciences, Tokyo Institue of Technology, and is supported by a Grantin-Aid (C-13650444) from Japanese Goverment. The forth author is supported in part by a Grant-in-Aid for Scientific Research on Priority Areas “Discovery Science” from Japanese Goverment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TOCS Submission Version title : Provably Fast Training Algorithms for Support Vector

Support Vector Machines are a family of algorithms for the analysis of data based on convex Quadratic Programming. We derive randomized algorithms for training SVMs, based on a variation of Random Sampling Techniques; these have been successfully used for similar problems. We formally prove an upper bound on the expected running time which is quasilinear with respect to the number of data point...

متن کامل

Provably Fast Support Vector Regression Using Random Sampling

Support Vector Machines are a family of data analysis algorithms, based on convex Quadratic Programming. Their use has been demonstrated in classification, regression, and clustering problems. In previous work we have proved that a random sampling technique based on an evolving discrete probability distribution provides a training algorithm for Support Vector Classification with provably low ex...

متن کامل

کاربرد الگوریتم‌های داده‌کاوی در تفکیک منابع رسوبی حوزۀ آبخیز نوده گناباد

Introduction: Reduction of sediment supply requires the implementation of soil conservation and sediment control programs in the form of watershed management plans. Sediment control programs require identifying the relative importance of sediment sources, their quantitative ascription and identification of critical areas within the watersheds. The sediment source ascription is involves two...

متن کامل

Efficient Large Scale Linear Programming Support Vector Machines

This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many desirable properties. For example, it is provably convergent, scales well to large datasets, is easy to implement, and can be extended to handle support vector regression and other SVM variants. We demonstrate the effi...

متن کامل

A Comparative Study of Extreme Learning Machines and Support Vector Machines in Prediction of Sediment Transport in Open Channels

The limiting velocity in open channels to prevent long-term sedimentation is predicted in this paper using a powerful soft computing technique known as Extreme Learning Machines (ELM). The ELM is a single Layer Feed-forward Neural Network (SLFNN) with a high level of training speed. The dimensionless parameter of limiting velocity which is known as the densimetric Froude number (Fr) is predicte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007